On the Implementation of Polygonal Approximation Algorithms
نویسندگان
چکیده
institute of information and computing sciences, utrecht university technical report UU-CS-2003-005
منابع مشابه
Thinning-free Polygonal Approximation of Thick Digital Curves Using Cellular Envelope
Since the inception of successful rasterization of curves and objects in the digital space, several algorithms have been proposed for approximating a given digital curve. All these algorithms, however, resort to thinning as preprocessing before approximating a digital curve with changing thickness. Described in this paper is a novel thinning-free algorithm for polygonal approximation of an arbi...
متن کاملPACE: Polygonal Approximation of Thick Digital Curves Using Cellular Envelope
A novel algorithm to derive an approximate cellular envelope of an arbitrarily thick digital curve on a 2D grid is proposed in this paper. The concept of “cellular envelope” is newly introduced in this paper, which is defined as the smallest set of cells containing the given curve, and hence bounded by two tightest (inner and outer) isothetic polygons on the grid. Contrary to the existing algor...
متن کاملPolygonal chain approximation: a query based approach
In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results based on this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. Our algorithms are simple, based on standard geometric operations, and thus suitable for efficient implementation. We also show that the query based approach ...
متن کاملA Uni ed Approach for Hierarchical Adaptive Tesselation of Surfaces
The polygonization, or tesselation, of surfaces is a classical problem that has many practical applications in computer graphics and geometric modeling. The problem consists in computing a piecewise linear approximation for a smooth surface described either by parametric or implicit functions. A polygonal mesh is the one of the simplest forms of surface description and therefore is the represen...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کامل